package luogu.hash;
//P1125 [NOIP2008 提高组] 笨小猴

import java.util.Scanner;

/**
 * @author :chenjie
 * @date :Created 2023/1/3 15:50
 */
public class StupidLittleMonkey {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        String s=sc.nextLine();
        char[] chars = s.toCharArray();
        int[]arr=new int[26];
        int min=110,max=0,j=0;
        for (int i = 0; i < chars.length; i++) {
            if(chars[i]>='a'&&chars[i]<='z'){
                arr[chars[i]-'a']++;
                if(min>arr[chars[i]-'a']||j==chars[i]-'a'){//注意min一直为1的情况最小的不知出现一次
                    min=arr[chars[i]-'a'];
                    j=chars[i]-'a';
                }
                if(max<arr[chars[i]-'a']){
                    max=arr[chars[i]-'a'];
                }
            }
        }
        if(panduan(max-min)){
            System.out.println("Lucky Word");
            System.out.println(max-min);
        }else {
            System.out.println("No Answer");
            System.out.println(0);
        }
    }
    static boolean panduan(int x){
        if(x==0||x==1){
            return false;
        }
        for (int i = 2; i <= Math.sqrt(x); i++) {
            if(x%i==0){
                return false;
            }
        }
        return true;
    }
}
